TSTP Solution File: CSR143^1 by cvc5---1.0.5
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : cvc5---1.0.5
% Problem : CSR143^1 : TPTP v8.1.2. Released v4.1.0.
% Transfm : none
% Format : tptp
% Command : do_cvc5 %s %d
% Computer : n007.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Wed Aug 30 21:07:14 EDT 2023
% Result : Theorem 0.14s 0.43s
% Output : Proof 0.14s
% Verified :
% SZS Type : -
% Comments :
%------------------------------------------------------------------------------
%----WARNING: Could not form TPTP format derivation
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.00/0.09 % Problem : CSR143^1 : TPTP v8.1.2. Released v4.1.0.
% 0.00/0.10 % Command : do_cvc5 %s %d
% 0.09/0.29 % Computer : n007.cluster.edu
% 0.09/0.29 % Model : x86_64 x86_64
% 0.09/0.29 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.09/0.29 % Memory : 8042.1875MB
% 0.09/0.29 % OS : Linux 3.10.0-693.el7.x86_64
% 0.09/0.29 % CPULimit : 300
% 0.09/0.29 % WCLimit : 300
% 0.09/0.29 % DateTime : Mon Aug 28 11:03:28 EDT 2023
% 0.09/0.29 % CPUTime :
% 0.14/0.40 %----Proving TH0
% 0.14/0.41 %------------------------------------------------------------------------------
% 0.14/0.41 % File : CSR143^1 : TPTP v8.1.2. Released v4.1.0.
% 0.14/0.41 % Domain : Commonsense Reasoning
% 0.14/0.41 % Problem : Who is the husband of Corina during 2009?
% 0.14/0.41 % Version : Especial.
% 0.14/0.41 % English : During 2009 Corina is the wife of Chris. True holds at any time.
% 0.14/0.41 % Who is the husband of Corina during 2009?
% 0.14/0.41
% 0.14/0.41 % Refs : [Ben10] Benzmueller (2010), Email to Geoff Sutcliffe
% 0.14/0.41 % Source : [Ben10]
% 0.14/0.41 % Names : ex_2.tq_SUMO_handselected [Ben10]
% 0.14/0.41
% 0.14/0.41 % Status : Theorem
% 0.14/0.41 % Rating : 0.09 v8.1.0, 0.17 v7.4.0, 0.11 v7.3.0, 0.10 v7.2.0, 0.12 v7.1.0, 0.14 v7.0.0, 0.12 v6.4.0, 0.14 v6.3.0, 0.17 v6.2.0, 0.00 v6.1.0, 0.50 v6.0.0, 0.17 v5.5.0, 0.20 v5.4.0, 0.50 v5.0.0, 0.25 v4.1.0
% 0.14/0.41 % Syntax : Number of formulae : 14 ( 1 unt; 9 typ; 0 def)
% 0.14/0.41 % Number of atoms : 10 ( 0 equ; 0 cnn)
% 0.14/0.41 % Maximal formula atoms : 3 ( 2 avg)
% 0.14/0.41 % Number of connectives : 22 ( 0 ~; 0 |; 0 &; 20 @)
% 0.14/0.41 % ( 1 <=>; 1 =>; 0 <=; 0 <~>)
% 0.14/0.41 % Maximal formula depth : 9 ( 5 avg)
% 0.14/0.41 % Number of types : 3 ( 1 usr)
% 0.14/0.41 % Number of type conns : 17 ( 17 >; 0 *; 0 +; 0 <<)
% 0.14/0.41 % Number of symbols : 9 ( 8 usr; 4 con; 0-2 aty)
% 0.14/0.41 % Number of variables : 6 ( 0 ^; 5 !; 1 ?; 6 :)
% 0.14/0.41 % SPC : TH0_THM_NEQ_NAR
% 0.14/0.41
% 0.14/0.41 % Comments : This is a simple test problem for reasoning in/about SUMO.
% 0.14/0.41 % Initally the problem has been hand generated in KIF syntax in
% 0.14/0.41 % SigmaKEE and then automatically translated by Benzmueller's
% 0.14/0.41 % KIF2TH0 translator into THF syntax.
% 0.14/0.41 % : The translation has been applied in three modes: handselected,
% 0.14/0.41 % SInE, and local. The local mode only translates the local
% 0.14/0.41 % assumptions and the query. The SInE mode additionally translates
% 0.14/0.41 % the SInE extract of the loaded knowledge base (usually SUMO). The
% 0.14/0.41 % handselected mode contains a hand-selected relevant axioms.
% 0.14/0.41 % : The examples are selected to illustrate the benefits of
% 0.14/0.41 % higher-order reasoning in ontology reasoning.
% 0.14/0.41 %------------------------------------------------------------------------------
% 0.14/0.41 %----The extracted signature
% 0.14/0.41 thf(numbers,type,
% 0.14/0.41 num: $tType ).
% 0.14/0.41
% 0.14/0.41 thf(holdsDuring_THFTYPE_IiooI,type,
% 0.14/0.41 holdsDuring_THFTYPE_IiooI: $i > $o > $o ).
% 0.14/0.41
% 0.14/0.41 thf(husband_THFTYPE_IiioI,type,
% 0.14/0.41 husband_THFTYPE_IiioI: $i > $i > $o ).
% 0.14/0.41
% 0.14/0.41 thf(lChris_THFTYPE_i,type,
% 0.14/0.41 lChris_THFTYPE_i: $i ).
% 0.14/0.41
% 0.14/0.41 thf(lCorina_THFTYPE_i,type,
% 0.14/0.41 lCorina_THFTYPE_i: $i ).
% 0.14/0.41
% 0.14/0.41 thf(lYearFn_THFTYPE_IiiI,type,
% 0.14/0.41 lYearFn_THFTYPE_IiiI: $i > $i ).
% 0.14/0.41
% 0.14/0.41 thf(n2009_THFTYPE_i,type,
% 0.14/0.41 n2009_THFTYPE_i: $i ).
% 0.14/0.41
% 0.14/0.41 thf(wife_THFTYPE_IiioI,type,
% 0.14/0.41 wife_THFTYPE_IiioI: $i > $i > $o ).
% 0.14/0.41
% 0.14/0.41 %----The handselected axioms from the knowledge base
% 0.14/0.41 thf(inverse_THFTYPE_IIiioIIiioIoI,type,
% 0.14/0.41 inverse_THFTYPE_IIiioIIiioIoI: ( $i > $i > $o ) > ( $i > $i > $o ) > $o ).
% 0.14/0.41
% 0.14/0.41 thf(ax,axiom,
% 0.14/0.41 inverse_THFTYPE_IIiioIIiioIoI @ husband_THFTYPE_IiioI @ wife_THFTYPE_IiioI ).
% 0.14/0.41
% 0.14/0.41 thf(ax_001,axiom,
% 0.14/0.41 ! [REL2: $i > $i > $o,REL1: $i > $i > $o] :
% 0.14/0.41 ( ( inverse_THFTYPE_IIiioIIiioIoI @ REL1 @ REL2 )
% 0.14/0.41 => ! [INST1: $i,INST2: $i] :
% 0.14/0.41 ( ( REL1 @ INST1 @ INST2 )
% 0.14/0.41 <=> ( REL2 @ INST2 @ INST1 ) ) ) ).
% 0.14/0.41
% 0.14/0.41 %----The translated axioms
% 0.14/0.41 thf(ax_002,axiom,
% 0.14/0.41 ! [Z: $i] : ( holdsDuring_THFTYPE_IiooI @ Z @ $true ) ).
% 0.14/0.41
% 0.14/0.41 thf(ax_003,axiom,
% 0.14/0.41 holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ( wife_THFTYPE_IiioI @ lCorina_THFTYPE_i @ lChris_THFTYPE_i ) ).
% 0.14/0.41
% 0.14/0.41 %----The translated conjectures
% 0.14/0.41 thf(con,conjecture,
% 0.14/0.41 ? [X: $i] : ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ( husband_THFTYPE_IiioI @ X @ lCorina_THFTYPE_i ) ) ).
% 0.14/0.41
% 0.14/0.41 %------------------------------------------------------------------------------
% 0.14/0.41 ------- convert to smt2 : /export/starexec/sandbox/tmp/tmp.bAUJjL7DVp/cvc5---1.0.5_15250.p...
% 0.14/0.41 (declare-sort $$unsorted 0)
% 0.14/0.41 (declare-sort tptp.num 0)
% 0.14/0.41 (declare-fun tptp.holdsDuring_THFTYPE_IiooI ($$unsorted Bool) Bool)
% 0.14/0.43 (declare-fun tptp.husband_THFTYPE_IiioI ($$unsorted $$unsorted) Bool)
% 0.14/0.43 (declare-fun tptp.lChris_THFTYPE_i () $$unsorted)
% 0.14/0.43 (declare-fun tptp.lCorina_THFTYPE_i () $$unsorted)
% 0.14/0.43 (declare-fun tptp.lYearFn_THFTYPE_IiiI ($$unsorted) $$unsorted)
% 0.14/0.43 (declare-fun tptp.n2009_THFTYPE_i () $$unsorted)
% 0.14/0.43 (declare-fun tptp.wife_THFTYPE_IiioI ($$unsorted $$unsorted) Bool)
% 0.14/0.43 (declare-fun tptp.inverse_THFTYPE_IIiioIIiioIoI ((-> $$unsorted $$unsorted Bool) (-> $$unsorted $$unsorted Bool)) Bool)
% 0.14/0.43 (assert (@ (@ tptp.inverse_THFTYPE_IIiioIIiioIoI tptp.husband_THFTYPE_IiioI) tptp.wife_THFTYPE_IiioI))
% 0.14/0.43 (assert (forall ((REL2 (-> $$unsorted $$unsorted Bool)) (REL1 (-> $$unsorted $$unsorted Bool))) (=> (@ (@ tptp.inverse_THFTYPE_IIiioIIiioIoI REL1) REL2) (forall ((INST1 $$unsorted) (INST2 $$unsorted)) (= (@ (@ REL1 INST1) INST2) (@ (@ REL2 INST2) INST1))))))
% 0.14/0.43 (assert (forall ((Z $$unsorted)) (@ (@ tptp.holdsDuring_THFTYPE_IiooI Z) true)))
% 0.14/0.43 (assert (@ (@ tptp.holdsDuring_THFTYPE_IiooI (@ tptp.lYearFn_THFTYPE_IiiI tptp.n2009_THFTYPE_i)) (@ (@ tptp.wife_THFTYPE_IiioI tptp.lCorina_THFTYPE_i) tptp.lChris_THFTYPE_i)))
% 0.14/0.43 (assert (not (exists ((X $$unsorted)) (@ (@ tptp.holdsDuring_THFTYPE_IiooI (@ tptp.lYearFn_THFTYPE_IiiI tptp.n2009_THFTYPE_i)) (@ (@ tptp.husband_THFTYPE_IiioI X) tptp.lCorina_THFTYPE_i)))))
% 0.14/0.43 (set-info :filename cvc5---1.0.5_15250)
% 0.14/0.43 (check-sat-assuming ( true ))
% 0.14/0.43 ------- get file name : TPTP file name is CSR143^1
% 0.14/0.43 ------- cvc5-thf : /export/starexec/sandbox/solver/bin/cvc5---1.0.5_15250.smt2...
% 0.14/0.43 --- Run --ho-elim --full-saturate-quant at 10...
% 0.14/0.43 % SZS status Theorem for CSR143^1
% 0.14/0.43 % SZS output start Proof for CSR143^1
% 0.14/0.43 (
% 0.14/0.43 (let ((_let_1 (not (exists ((X $$unsorted)) (@ (@ tptp.holdsDuring_THFTYPE_IiooI (@ tptp.lYearFn_THFTYPE_IiiI tptp.n2009_THFTYPE_i)) (@ (@ tptp.husband_THFTYPE_IiioI X) tptp.lCorina_THFTYPE_i)))))) (let ((_let_2 (@ (@ tptp.holdsDuring_THFTYPE_IiooI (@ tptp.lYearFn_THFTYPE_IiiI tptp.n2009_THFTYPE_i)) (@ (@ tptp.wife_THFTYPE_IiioI tptp.lCorina_THFTYPE_i) tptp.lChris_THFTYPE_i)))) (let ((_let_3 (forall ((REL2 (-> $$unsorted $$unsorted Bool)) (REL1 (-> $$unsorted $$unsorted Bool))) (=> (@ (@ tptp.inverse_THFTYPE_IIiioIIiioIoI REL1) REL2) (forall ((INST1 $$unsorted) (INST2 $$unsorted)) (= (@ (@ REL1 INST1) INST2) (@ (@ REL2 INST2) INST1))))))) (let ((_let_4 (@ (@ tptp.inverse_THFTYPE_IIiioIIiioIoI tptp.husband_THFTYPE_IiioI) tptp.wife_THFTYPE_IiioI))) (let ((_let_5 (ho_10 k_9 (ho_13 k_12 tptp.n2009_THFTYPE_i)))) (let ((_let_6 (ho_11 _let_5 BOOLEAN_TERM_VARIABLE_995))) (let ((_let_7 (ho_11 _let_5 BOOLEAN_TERM_VARIABLE_1390))) (let ((_let_8 (APPLY_UF ho_11))) (let ((_let_9 (ho_8 (ho_3 k_2 tptp.lCorina_THFTYPE_i) tptp.lChris_THFTYPE_i))) (let ((_let_10 (MACRO_SR_PRED_INTRO :args ((= _let_9 BOOLEAN_TERM_VARIABLE_995))))) (let ((_let_11 (REFL :args (_let_5)))) (let ((_let_12 (EQ_RESOLVE (ASSUME :args (_let_2)) (TRANS (PREPROCESS :args ((= _let_2 (ho_11 _let_5 _let_9)))) (CONG _let_11 _let_10 :args _let_8))))) (let ((_let_13 (forall ((X $$unsorted)) (not (ho_11 (ho_10 k_9 (ho_13 k_12 tptp.n2009_THFTYPE_i)) (ho_8 (ho_3 k_4 X) tptp.lCorina_THFTYPE_i)))))) (let ((_let_14 (not _let_7))) (let ((_let_15 (EQ_RESOLVE (ASSUME :args (_let_1)) (TRANS (MACRO_SR_EQ_INTRO :args (_let_1 SB_DEFAULT SBA_FIXPOINT)) (PREPROCESS :args ((= (forall ((X $$unsorted)) (not (@ (@ tptp.holdsDuring_THFTYPE_IiooI (@ tptp.lYearFn_THFTYPE_IiiI tptp.n2009_THFTYPE_i)) (@ (@ tptp.husband_THFTYPE_IiioI X) tptp.lCorina_THFTYPE_i)))) _let_13))))))) (let ((_let_16 (ho_8 (ho_3 k_4 tptp.lChris_THFTYPE_i) tptp.lCorina_THFTYPE_i))) (let ((_let_17 (MACRO_SR_PRED_INTRO :args ((= _let_16 BOOLEAN_TERM_VARIABLE_1390))))) (let ((_let_18 (_let_13))) (let ((_let_19 (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (EQ_RESOLVE (SCOPE (INSTANTIATE _let_15 :args (tptp.lChris_THFTYPE_i QUANTIFIERS_INST_CBQI_CONFLICT)) :args _let_18) (CONG (REFL :args _let_18) (CONG (CONG _let_11 _let_17 :args _let_8) :args (not)) :args (=>)))) _let_15 :args (_let_14 false _let_13)))) (let ((_let_20 (not BOOLEAN_TERM_VARIABLE_995))) (let ((_let_21 (= _let_9 _let_16))) (let ((_let_22 (not _let_9))) (let ((_let_23 (ho_7 (ho_6 k_5 k_4) k_2))) (let ((_let_24 (not _let_23))) (let ((_let_25 (or _let_24 _let_21))) (let ((_let_26 (forall ((BOUND_VARIABLE_662 |u_(-> $$unsorted $$unsorted Bool)|) (BOUND_VARIABLE_667 |u_(-> $$unsorted $$unsorted Bool)|) (BOUND_VARIABLE_629 $$unsorted) (BOUND_VARIABLE_627 $$unsorted)) (or (not (ho_7 (ho_6 k_5 BOUND_VARIABLE_667) BOUND_VARIABLE_662)) (= (ho_8 (ho_3 BOUND_VARIABLE_662 BOUND_VARIABLE_629) BOUND_VARIABLE_627) (ho_8 (ho_3 BOUND_VARIABLE_667 BOUND_VARIABLE_627) BOUND_VARIABLE_629)))))) (let ((_let_27 (EQ_RESOLVE (ASSUME :args (_let_3)) (TRANS (MACRO_SR_EQ_INTRO :args (_let_3 SB_DEFAULT SBA_FIXPOINT)) (PREPROCESS :args ((= (forall ((REL2 (-> $$unsorted $$unsorted Bool)) (REL1 (-> $$unsorted $$unsorted Bool)) (BOUND_VARIABLE_629 $$unsorted) (BOUND_VARIABLE_627 $$unsorted)) (or (not (@ (@ tptp.inverse_THFTYPE_IIiioIIiioIoI REL1) REL2)) (= (@ (@ REL1 BOUND_VARIABLE_627) BOUND_VARIABLE_629) (@ (@ REL2 BOUND_VARIABLE_629) BOUND_VARIABLE_627)))) _let_26))))))) (let ((_let_28 (forall ((u |u_(-> $$unsorted $$unsorted Bool)|) (e |u_(-> $$unsorted Bool)|) (i $$unsorted)) (not (forall ((v |u_(-> $$unsorted $$unsorted Bool)|)) (not (forall ((ii $$unsorted)) (= (ho_3 v ii) (ite (= i ii) e (ho_3 u ii)))))))))) (let ((_let_29 (forall ((x |u_(-> $$unsorted $$unsorted Bool)|) (y |u_(-> $$unsorted $$unsorted Bool)|)) (or (not (forall ((z $$unsorted)) (= (ho_3 x z) (ho_3 y z)))) (= x y))))) (let ((_let_30 (forall ((u |u_(-> $$unsorted Bool)|) (e Bool) (i $$unsorted)) (not (forall ((v |u_(-> $$unsorted Bool)|)) (not (forall ((ii $$unsorted)) (= (ho_8 v ii) (ite (= i ii) e (ho_8 u ii)))))))))) (let ((_let_31 (forall ((x |u_(-> $$unsorted Bool)|) (y |u_(-> $$unsorted Bool)|)) (or (not (forall ((z $$unsorted)) (= (ho_8 x z) (ho_8 y z)))) (= x y))))) (let ((_let_32 (forall ((u |u_(-> _u_(-> $$unsorted $$unsorted Bool)_ Bool)|) (e Bool) (i |u_(-> $$unsorted $$unsorted Bool)|)) (not (forall ((v |u_(-> _u_(-> $$unsorted $$unsorted Bool)_ Bool)|)) (not (forall ((ii |u_(-> $$unsorted $$unsorted Bool)|)) (= (ho_7 v ii) (ite (= i ii) e (ho_7 u ii)))))))))) (let ((_let_33 (forall ((x |u_(-> _u_(-> $$unsorted $$unsorted Bool)_ Bool)|) (y |u_(-> _u_(-> $$unsorted $$unsorted Bool)_ Bool)|)) (or (not (forall ((z |u_(-> $$unsorted $$unsorted Bool)|)) (= (ho_7 x z) (ho_7 y z)))) (= x y))))) (let ((_let_34 (forall ((u |u_(-> Bool Bool)|) (e Bool) (i Bool)) (not (forall ((v |u_(-> Bool Bool)|)) (not (forall ((ii Bool)) (= (ho_11 v ii) (ite (= i ii) e (ho_11 u ii)))))))))) (let ((_let_35 (forall ((x |u_(-> Bool Bool)|) (y |u_(-> Bool Bool)|)) (or (not (forall ((z Bool)) (= (ho_11 x z) (ho_11 y z)))) (= x y))))) (let ((_let_36 (forall ((u |u_(-> $$unsorted Bool Bool)|) (e |u_(-> Bool Bool)|) (i $$unsorted)) (not (forall ((v |u_(-> $$unsorted Bool Bool)|)) (not (forall ((ii $$unsorted)) (= (ho_10 v ii) (ite (= i ii) e (ho_10 u ii)))))))))) (let ((_let_37 (forall ((x |u_(-> $$unsorted Bool Bool)|) (y |u_(-> $$unsorted Bool Bool)|)) (or (not (forall ((z $$unsorted)) (= (ho_10 x z) (ho_10 y z)))) (= x y))))) (let ((_let_38 (forall ((u |u_(-> _u_(-> $$unsorted $$unsorted Bool)_ _u_(-> $$unsorted $$unsorted Bool)_ Bool)|) (e |u_(-> _u_(-> $$unsorted $$unsorted Bool)_ Bool)|) (i |u_(-> $$unsorted $$unsorted Bool)|)) (not (forall ((v |u_(-> _u_(-> $$unsorted $$unsorted Bool)_ _u_(-> $$unsorted $$unsorted Bool)_ Bool)|)) (not (forall ((ii |u_(-> $$unsorted $$unsorted Bool)|)) (= (ho_6 v ii) (ite (= i ii) e (ho_6 u ii)))))))))) (let ((_let_39 (forall ((x |u_(-> _u_(-> $$unsorted $$unsorted Bool)_ _u_(-> $$unsorted $$unsorted Bool)_ Bool)|) (y |u_(-> _u_(-> $$unsorted $$unsorted Bool)_ _u_(-> $$unsorted $$unsorted Bool)_ Bool)|)) (or (not (forall ((z |u_(-> $$unsorted $$unsorted Bool)|)) (= (ho_6 x z) (ho_6 y z)))) (= x y))))) (let ((_let_40 (forall ((u |u_(-> $$unsorted $$unsorted)|) (e $$unsorted) (i $$unsorted)) (not (forall ((v |u_(-> $$unsorted $$unsorted)|)) (not (forall ((ii $$unsorted)) (= (ho_13 v ii) (ite (= i ii) e (ho_13 u ii)))))))))) (let ((_let_41 (forall ((x |u_(-> $$unsorted $$unsorted)|) (y |u_(-> $$unsorted $$unsorted)|)) (or (not (forall ((z $$unsorted)) (= (ho_13 x z) (ho_13 y z)))) (= x y))))) (let ((_let_42 (MACRO_RESOLUTION_TRUST (REORDERING (CNF_OR_POS :args (_let_25)) :args ((or _let_24 _let_21 (not _let_25)))) (AND_ELIM (MACRO_SR_PRED_TRANSFORM (AND_INTRO (EQ_RESOLVE (ASSUME :args (_let_4)) (PREPROCESS :args ((= _let_4 _let_23)))) (PREPROCESS :args ((and _let_41 _let_40 _let_39 _let_38 _let_37 _let_36 _let_35 _let_34 _let_33 _let_32 _let_31 _let_30 _let_29 _let_28)))) :args ((and _let_23 _let_41 _let_40 _let_39 _let_38 _let_37 _let_36 _let_35 _let_34 _let_33 _let_32 _let_31 _let_30 _let_29 _let_28))) :args (0)) (MACRO_RESOLUTION_TRUST (IMPLIES_ELIM (SCOPE (INSTANTIATE _let_27 :args (k_2 k_4 tptp.lCorina_THFTYPE_i tptp.lChris_THFTYPE_i QUANTIFIERS_INST_E_MATCHING ((not (= (ho_7 (ho_6 k_5 BOUND_VARIABLE_667) BOUND_VARIABLE_662) false)) (ho_8 (ho_3 BOUND_VARIABLE_662 BOUND_VARIABLE_629) BOUND_VARIABLE_627)))) :args (_let_26))) _let_27 :args (_let_25 false _let_26)) :args (_let_21 false _let_23 false _let_25)))) (let ((_let_43 (not _let_21))) (let ((_let_44 (_let_21))) (let ((_let_45 (not BOOLEAN_TERM_VARIABLE_1390))) (let ((_let_46 (not _let_6))) (let ((_let_47 (or))) (let ((_let_48 (MACRO_SR_PRED_INTRO :args ((= (not _let_14) _let_7))))) (let ((_let_49 (_let_45))) (let ((_let_50 (REFL :args (_let_46)))) (let ((_let_51 (_let_20))) (let ((_let_52 (TRUE_INTRO _let_12))) (let ((_let_53 (ASSUME :args (BOOLEAN_TERM_VARIABLE_995)))) (let ((_let_54 (ASSUME :args (BOOLEAN_TERM_VARIABLE_1390)))) (let ((_let_55 (ASSUME :args (_let_14)))) (let ((_let_56 (SYMM (FALSE_INTRO _let_55)))) (let ((_let_57 (MACRO_RESOLUTION_TRUST (REORDERING (EQ_RESOLVE (NOT_AND (MACRO_SR_PRED_TRANSFORM (SCOPE (AND_INTRO _let_12 _let_53 _let_54 _let_55) :args (BOOLEAN_TERM_VARIABLE_995 _let_6 BOOLEAN_TERM_VARIABLE_1390 _let_14)) (SCOPE (MACRO_SR_PRED_ELIM (TRANS _let_56 (CONG _let_11 (TRANS (TRUE_INTRO _let_54) (SYMM (TRUE_INTRO _let_53))) :args _let_8) _let_52)) :args (_let_6 BOOLEAN_TERM_VARIABLE_995 BOOLEAN_TERM_VARIABLE_1390 _let_14)) :args ((not (and BOOLEAN_TERM_VARIABLE_995 _let_6 BOOLEAN_TERM_VARIABLE_1390 _let_14)) SB_LITERAL))) (CONG (REFL :args _let_51) _let_50 (REFL :args _let_49) _let_48 :args _let_47)) :args ((or _let_46 _let_20 _let_7 _let_45))) _let_19 _let_12 (EQUIV_ELIM1 _let_17) (REORDERING (CNF_EQUIV_POS1 :args _let_44) :args ((or _let_22 _let_16 _let_43))) _let_42 (REORDERING (EQUIV_ELIM1 _let_10) :args ((or BOOLEAN_TERM_VARIABLE_995 _let_22))) :args (_let_22 true _let_7 false _let_6 false BOOLEAN_TERM_VARIABLE_1390 false _let_16 false _let_21 false BOOLEAN_TERM_VARIABLE_995)))) (let ((_let_58 (not _let_16))) (let ((_let_59 (ASSUME :args _let_51))) (let ((_let_60 (ASSUME :args _let_49))) (SCOPE (SCOPE (MACRO_RESOLUTION_TRUST (REORDERING (EQ_RESOLVE (NOT_AND (MACRO_SR_PRED_TRANSFORM (SCOPE (AND_INTRO _let_12 _let_59 _let_60 _let_55) :args (_let_6 _let_20 _let_14 _let_45)) (SCOPE (MACRO_SR_PRED_ELIM (TRANS _let_56 (CONG _let_11 (TRANS (FALSE_INTRO _let_60) (SYMM (FALSE_INTRO _let_59))) :args _let_8) _let_52)) :args (_let_6 _let_20 _let_45 _let_14)) :args ((not (and _let_6 _let_20 _let_14 _let_45)) SB_LITERAL))) (CONG _let_50 (MACRO_SR_PRED_INTRO :args ((= (not _let_20) BOOLEAN_TERM_VARIABLE_995))) _let_48 (MACRO_SR_PRED_INTRO :args ((= (not _let_45) BOOLEAN_TERM_VARIABLE_1390))) :args _let_47)) :args ((or BOOLEAN_TERM_VARIABLE_995 _let_46 BOOLEAN_TERM_VARIABLE_1390 _let_7))) (MACRO_RESOLUTION_TRUST (EQUIV_ELIM2 _let_17) (MACRO_RESOLUTION_TRUST (REORDERING (CNF_EQUIV_POS2 :args _let_44) :args ((or _let_9 _let_58 _let_43))) _let_57 _let_42 :args (_let_58 true _let_9 false _let_21)) :args (_let_45 true _let_16)) (MACRO_RESOLUTION_TRUST (EQUIV_ELIM2 _let_10) _let_57 :args (_let_20 true _let_9)) _let_19 _let_12 :args (false true BOOLEAN_TERM_VARIABLE_1390 true BOOLEAN_TERM_VARIABLE_995 true _let_7 false _let_6)) :args (_let_4 _let_3 (forall ((Z $$unsorted)) (@ (@ tptp.holdsDuring_THFTYPE_IiooI Z) true)) _let_2 _let_1 true)))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))))
% 0.14/0.43 )
% 0.14/0.43 % SZS output end Proof for CSR143^1
% 0.14/0.43 % cvc5---1.0.5 exiting
% 0.14/0.44 % cvc5---1.0.5 exiting
%------------------------------------------------------------------------------